A short proof of Gowers' lower bound for the regularity lemma
نویسندگان
چکیده
A celebrated result of Gowers states that for every > 0 there is a graph G such that every -regular partition of G (in the sense of Szemerédi’s regularity lemma) has order given by a tower of exponents of height polynomial in 1/ . In this note we give a new proof of this result that uses a construction and proof of correctness that are significantly simpler and shorter.
منابع مشابه
Bounds for graph regularity and removal lemmas
We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck/ log∗ k pairs of parts which are not -regular, where c, > 0 are absolute constants. This bound is tight up to the constant c and addresses a question of Gowers on the number of irregular pairs in Szemerédi’s regularity lemma. In order to gain some control ...
متن کاملA new proof of the graph removal lemma
Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n) copies of H can be made H-free by removing o(n) edges. We give a new proof which avoids Szemerédi’s regularity lemma and gives a better bound. This approach also works to give improved bounds for the directed and multicolored analogues of the graph removal lemma. This answers question...
متن کاملA tight lower bound for Szemerédi's regularity lemma
Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma.
متن کاملTwo Constructions for Tower-Type Lower Bounds of Szemerédi’s Regularity Lemma
The theory of random graph is one of the most important theories in modern combinatorics and theoretical computer science. This naturally leads to the following question: what is the essential property of a random graph? How can we distinguish a given graph from a random graphs? This leads to the development of pseudo-random graph theory (quasi-random graphs). [2] gives a complete survey on pse...
متن کاملDissertation Defense On Algorithmic Hypergraph Regularity
Thomason and Chung, Graham and Wilson were the first to systematically study quasirandom graphs and hypergraphs and showed that several properties of random graphs imply each other in a deterministic sense. In particular, they showed that ε-regularity from Szemerédi’s regularity lemma is equivalent to their concepts. Over recent years several hypergraph regularity lemmas were established. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 36 شماره
صفحات -
تاریخ انتشار 2016